Infinitely repeatable games
نویسندگان
چکیده
منابع مشابه
Stochastic games with infinitely many interacting agents
We introduce and study a class of infinite-horizon non-zero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove...
متن کاملFast Equilibrium Computation for Infinitely Repeated Games
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoffs) can be computed in polynomial time, as follows: according to the folk theorem, we compute minimax strategies for both players to calculate the punishment values, and subsequently find a mixture over outcomes that exceeds these punishment values. However, for very large games, even computing mi...
متن کاملValues of Games with Infinitely Many Players
∗Institute of Mathematics; and Center for Rationality and Interactive Decision Theory; The Hebrew University of Jerusalem; Givat Ram; Jerusalem 91904; Israel. E-mail: [email protected] This research was in part supported by The Israel Science Foundation grant 382/98. J.E.L. Classification numbers. D70, D71, D63, C71
متن کاملSwitching costs in infinitely repeated games
We show that small switching costs can have surprisingly dramatic effects in infinitely repeated games if these costs are large relative to payoffs in a single period. This shows that the results in Lipman and Wang do have analogs in the case of infinitely repeated games [Lipman, B., Wang, R., 2000. Switching costs in frequently repeated games. J. Econ. Theory 93, August 2000, 149–190]. We also...
متن کاملPositional Determinacy of Games with Infinitely Many
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy. The theory of such games is well studied for winning c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1960
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1960.10.879